Propositional Fusion Rules
نویسندگان
چکیده
In previous papers, we have presented a logic-based framework for merging structured news reports [14, 16, 15]. Structured news reports are XML documents, where the text entries are restricted to individual words or simple phrases, such as names and domain-specific terminology, and numbers and units. We assume structured news reports do not require natural language processing. In this paper, we present propositional fusion rules as a way of implementing logic-based fusion for structured news reports. Fusion rules are a form of scripting language that define how structured news reports should be merged. The antecedent of a fusion rule is a call to investigate the information in the structured news reports and the background knowledge, and the consequent of a fusion rule is a formula specifying an action to be undertaken to form a merged report. It is expected that a set of fusion rules is defined for any given application. We give the syntax and mode of execution for fusion rules, and explain how the resulting actions give a merged report.
منابع مشابه
A layered rule-based architecture for approximate knowledge fusion?
In this paper we present a framework for fusing approximate knowledge obtained from various distributed, heterogenous knowledge sources. This issue is substantial in modeling multi-agent systems, where a group of loosely coupled heterogeneous agents cooperate in achieving a common goal. In paper [5] we have focused on defining general mechanism for knowledge fusion. Next, the techniques ensurin...
متن کاملLogic-based approaches to information fusion
This survey covers recent contributions from the artificial intelligence research literature about logic-based information fusion. First, the main current approaches dealing with the standard propositional logic formalism are presented and compared. Then, techniques for fusing weighted belief bases are discussed. Finally, relationships between propositional information fusion and related areas ...
متن کاملRules and Arithmetics
This paper is concerned with the logical structure of arithmetical the ories We survey results concerning logics and admissible rules of con structive arithmetical theories We prove a new theorem the admissible propositional rules of Heyting Arithmetic are the same as the admissible propositional rules of Intuitionistic Propositional Logic We provide some further insights concerning predicate l...
متن کاملUsing Closed Sets of Rules for the Entailment of Literals
Entailment that is based on the application of simple production rules, of the form c← a1, . . . , an (n ≥ 0) is weaker than the propositional entailment that would be yielded by translating these rules into material implications. In this paper, we show that rulebased entailment coincides with the propositional entailment of literals, when the set of rules is closed under transposition, transit...
متن کاملExtending the Stable Model Semantics with More Expressive Rules
The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base for an efficient implementation, the new rules supplant the standard ones in practical applications of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003